An implicit algorithm for computing the minimal Gersgorin set
نویسندگان
چکیده
منابع مشابه
An Algorithm for Computing Minimal % Coxian Representations
T paper presents an algorithm for computing minimal ordered Coxian representations of phase-type distributions whose Laplace-Stieltjes transform has only real poles. We first identify a set of necessary and sufficient conditions for an ordered Coxian representation to be minimal with respect to the number of phases involved. The conditions establish a relationship between the Coxian representat...
متن کاملAn algorithm for computing minimal Geršgorin sets
The first algorithms for computing the minimal Geršgorn set were developed by Varga et all. in [17] for the use on small and medium size (dense) matrices. Here, we first discuss the existing methods and present a new approach based on the modified Newton’s method to find zeros of the parameter dependent left-most eigenvalue of a Z-matrix. Additionally, sampling technique used in the original wo...
متن کاملComputing the minimal covering set
We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm is based on a linear programming formulation of a subset of the minimal covering set known as the essential set. On the other hand, we show that no efficient algorithm exists for two variants of the minimal covering set, the minimal upward covering set and the minimal down...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولAn efficient algorithm for minimal primer set selection
SUMMARY We have developed U-PRIMER, a primer design program, to compute a minimal primer set (MPS) for any given set of DNA sequences. The U-PRIMER algorithm, which uses automatic variable fixing and automatic redundant constraint elimination to tackle the binary integer programming problem associated with the MPS selection problem. The program has been tested successfully with 32 adipocyte dev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2019
ISSN: 0354-5180,2406-0933
DOI: 10.2298/fil1913229m